On Minimal Cut Sets Representation with Binary Decision Diagrams

Since their introduction in form of a canonical representation logical functions, the Binary Decision Diagrams (BDDs) gained wide acceptance numerous industrial applications. This paper summarizes properties BDD Minimal Cut Sets (MCS) Fault Tree (FT) models most typically encountered nuclear energetics. sets from MCS are defined as paths top node to terminal nodes BDD, on which quantitative and qualitative FT analysis (FTA) is performed. The core FTA BDDs performed with help two fundamental algorithms, one for conditional probability evaluation another selection cut sets. accuracy represents an essential feature unbiased analysis, such event or determination importance measures. set algorithm shown generic version introducing predicates its criteria. As it known, efficiency depicted algorithms depends only number used representation. In order appraise compactness models, characteristics have herein been evaluated several real-life Nuclear Power Plant Krško. extraordinariness reflects ability implement advanced dynamic (i.e. what-if) models. approach recognized by commercial vendors upgrading Tools new versions implementing based algorithms.